Coded Caching in a Multi-Server System with Random Topology

نویسندگان

  • Nitish Mital
  • Deniz Gündüz
  • Cong Ling
چکیده

Cache-aided content delivery is studied in a multi-server system with K users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any ρ servers out of a total of P servers. Thanks to the availability of multiple servers, which model small base stations with limited storage capacity, user demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to a single server serving all the users simultaneously. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery; and it is shown that the achievable average sum delivery rate is comparable to that achieved by a single server, while the gap between the two depends on ρ, the available redundancy across servers. It is also shown that the gap can be reduced by increasing the storage capacity at the SBSs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Coded Multicast in Cache Networks with Arbitrary Content Placement

A new class of caching schemes, called coded caching can significantly reduce the communication bandwidth requirement for satisfying users’ demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users in practice prefer to decide what files to cache or discard some par...

متن کامل

On Multi-Server Coded Caching in the Low Memory Regime

In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small.We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at the content delivery phase. Surprisingly, in contrast to previous multi-server results which were proved to be order-optimal within a multiplicative factor of ...

متن کامل

Improved rate for a multi-server coded caching

Multi-server coded caching, which can further reduce the amount of transmission by means of the collaboration among these servers in the wireless network during the peak traffic times, can be seen everywhere in our life. This amount is called rate. The three servers setting (two data servers and one parity check server)is widely used in practice, e.g. redundant array of independent disks-4. Luo...

متن کامل

Efficient File Delivery for Coded Prefetching in Shared Cache Networks with Multiple Requests Per User

We consider a centralized caching network, where a server serves several groups of users, each having a common shared fixed-size cache and requesting multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an ...

متن کامل

On the Coded Caching Delivery Design over Wireless Networks

Coded caching scheme is a promising technique to migrate the network burden in peak hours, which attains more prominent gains than the uncoded caching. The coded caching scheme can be classified into two types, namely, the centralized and the decentralized scheme, according to whether the placement procedures are carefully designed or operated at random. However, most of the previous analysis a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1712.00649  شماره 

صفحات  -

تاریخ انتشار 2017